On Harrington's partition relation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NEW PROOF OF THE STRONG PARTITION RELATION ON tu,

Assuming the axiom of determinacy, we give a new proof of the strong partition relation on w, . The proof is direct and avoids appeal to complicated set-theoretic machinery.

متن کامل

Applying Relation Partition Algebra for Reverse Architecting

The ever increasing complexity and ever more rapidly changing requirements for software systems create a need for reuse and adaptation of existing software. An explicit description of the software architecture of a system may help to get a high-level overview of the system, thus facilitating re-use and adaptation of the system. Reverse architecting is a technique applied within Philips to make ...

متن کامل

A Partition Relation Using Strongly Compact Cardinals Sh761

If κ is strongly compact and λ > κ and λ is regular (or alternatively cf(λ) ≥ κ), then ` 2 ́+ → (λ+ ζ) θ holds for ζ, θ < κ. 2000 Mathematics Subject Classification. 2000 Math Subject Classification: 03E02. I would like to thank Alice Leonhardt for the beautiful typing. Research of the author was partially supported by the United States-Israel Binational Science Foundation. Publ.761. Latest Rev...

متن کامل

Rekonstruktion von Architekturansichten: Erfahrungen mit der Relation Partition Algebra

Symphony, das in [1] beschriebene Framework zur ansichtsorientierten Rekonstruktion von Softwarearchitekturen, basiert auf drei wesentlichen Konzepten: dem Quell-Blickwinkel, dem Ziel-Blickwinkel und der Zuordnung von Elementen des einen zu Elementen des anderen Blickwinkels. Ausgangspunkt für den Quell-Blickwinkel und seine Ansichten sind Implementationsfakten, die durch geeignete Relationen ü...

متن کامل

A Short Proof of a Partition Relation for Triples

We provide a much shorter proof of the following partition theorem of P. Erdős and R. Rado: If X is an uncountable linear order into which neither ω1 nor ω∗ 1 embeds, then X → (α, 4)3 for every ordinal α < ω + ω. We also provide two counterexamples to possible generalizations of this theorem, one of which answers a question of E. C. Milner and K. Prikry. MR Subject Classifications: 03E05, 04A20...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1980

ISSN: 0097-3165

DOI: 10.1016/0097-3165(80)90075-8